Attacks on the Rsa Cryptosystem and Some of Its Instances
نویسنده
چکیده
Two types of attacking the RSA cryptosystem are discussed. The rst aims at a careless choice of the primes p and q, which are the basis of RSA security. Choosing these primes carefully can prevent the cryptosystem from this type of attack. The second aims at special instances of RSA-based cryptographical protocols. Speciic properties of these protocols enable users of the system or even outsiders gain knowledge of information that they are not intended to know. If neccesary preventions are taken into account, these attacks pose no threat to the system at all, or more precisely to the algebraic structure of the RSA algorithm. However, in studying these attacks, we learn how to construct a stronger RSA cryptosystem, as well as gain some insights on what to avoid in designing a RSA-based cryptographical protocol.
منابع مشابه
Lattice based Attacks on Small Private Exponent RSA: A Survey
Lattice basis reduction algorithms have contributed a lot to cryptanalysis of RSA crypto system. With coppersmith’s theory of polynomials, these algorithms are searching for the weak instances of Number-theoretic cryptography, mainly RSA. In this paper we present several lattice based attacks on low private exponent of RSA.
متن کاملShort-Exponent RSA
In some applications, a short private exponent d is chosen to improve the decryption or signing process for RSA public key cryptosystem. However, in a typical RSA, if the private exponent d is selected first, the public exponent e should be of the same order of magnitude as φ(N). Sun et al. devised three RSA variants using unbalanced prime factors p and q to lower the computational cost. Unfort...
متن کاملMathematical Attacks on RSA Cryptosystem
In this paper some of the most common attacks against Rivest, Shamir, and Adleman (RSA) cryptosystem are presented. We describe the integer factoring attacks, attacks on the underlying mathematical function, as well as attacks that exploit details in implementations of the algorithm. Algorithms for each type of attacks are developed and analyzed by their complexity, memory requirements and area...
متن کاملSome Insightful Attacks on the RSA Cryptosystem
RSA has come to play a central role in electronic communications. As the first example of what is known as a public key cryptosystem, and the only one that has stood the test of nearly 30 years of attacks, RSA has become the algorithm of choice for encrypting Internet credit-card transactions, securing email, and authenticating phone calls. Like all practical cryptographic schemes, however, RSA...
متن کاملCommon modulus attacks on small private exponent RSA and some fast variants (in practice)
In this work we re-examine two common modulus attacks on RSA. First, we show that Guo’s continued fraction attack works much better in practice than previously expected. Given three instances of RSA with a common modulus N and private exponents each smaller than N the attack can factor the modulus about 93% of the time in practice. The success rate of the attack can be increased up to almost 10...
متن کامل